Recognition Algorithm for Diamond-Free Graphs
نویسندگان
چکیده
منابع مشابه
Recognition Algorithm for Diamond-Free Graphs
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognition algorithm for the diamond-free graphs which keeps the combinatorial structure of the graph by means of the decomposition, as well as an easy possibility to determine the clique number for the diamond-free graphs.
متن کاملColouring Diamond-free Graphs
The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (proper) k-colouring. For all graphs H up to five vertices, we classify the computational complexity of Colouring for (diamond, H)-free graphs. Our proof is based on combining known results together with proving that the clique-width is bounded for (diamond, P1+2P2)-free graphs. Our technique for han...
متن کاملOn (P5, diamond)-free graphs
We study the stability number, chromatic number and clique cover of graphs with no induced P5 and diamonds. In particular, we provide a way to obtain all imperfect (P5, diamond)-free graphs by iterated point multiplication or substitution from a /nite collection of small basic graphs. Corollaries of this and other structural properties, among which a result of Bacs1 o and Tuza, are (i) combinat...
متن کاملPerfectly contractile diamond-free graphs
Irena Rusu Universit e d'Orl eans, L.I.F.O., B.P. 6759, 45067 Orl eans Cedex 2, France Abstract Everett et al. [2] conjectured that a graph with no odd hole and no stretcher is perfectly contractile, i.e. it can be reduced to a clique by successively contracting even pairs. We show that this conjecture is true for diamond-free graphs, and propose a polynomial algorithm to perform the successive...
متن کاملDiamond-free circle graphs are Helly circle
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatica
سال: 2007
ISSN: 0868-4952,1822-8844
DOI: 10.15388/informatica.2007.188